Atomic Cut Elimination for classical Logic
نویسنده
چکیده
System SKS is a set of rules for classical propositional logic presented in the calculus of structures. Like sequent systems and unlike natural deduction systems, it has an explicit cut rule, which is admissible. In contrast to sequent systems, the cut rule can easily be restricted to atoms. This allows for a very simple cut elimination procedure based on plugging in parts of a proof, like normalisation in natural deduction and unlike cut elimination in the sequent calculus. It should thus be a good common starting point for investigations into both proof search as computation and proof normalisation as computation.
منابع مشابه
Classical Proofs via Basic Logic
Cut-elimination, besides being an important tool in proof-theory, plays a central role in the proofs-as-programs paradigm. In recent years this approach has been extended to classical logic (cf. Girard 1991, Parigot 1991, and recently Danos Joinet Schellinx 1997). This paper introduces a new sequent calculus for (propositional) classical logic, indicated by ? C. Both, the calculus and the cut-e...
متن کاملMELL in the calculus of structures
Gentzen’s sequent calculus is a tool to study properties of logics independently of semantics. The main property is cut-elimination which entails the subformula property and consistency. It is also the basis of methods of automated deduction. Although the sequent calculus is very appropriate for classical logic, it raises some concerns in dealing with more refined logics like linear logic. An e...
متن کاملCut-Elimination for Quantified Conditional Logic
A semantic embedding of quantified conditional logic in classical higher-order logic is utilized for reducing cut-elimination in the former logic to existing results for the latter logic. The presented embedding approach is adaptable to a wide range of other logics, for many of which cut-elimination is still open. However, special attention has to be payed to cut-simulation, which may render cu...
متن کاملComplexity Analysis of Cut Elimination in First Order Based Logics
The worst-case complexity of cut elimination in sequent calculi for first order based logics is investigated in terms of the increase in logical depth of the deduction. It is shown that given a calculus satisfying a general collection of sufficient conditions for cut elimination and given a deduction with cuts, there exists a cut free deduction with a logical depth, in the worst case, hyper-exp...
متن کاملStrong Normalisation of Cut-Elimination in Classical Logic
In this paper we present a strongly normalising cut-elimination procedure for classical logic. This procedure adapts Gentzen’s standard cut-reductions, but is less restrictive than previous strongly normalising cut-elimination procedures. In comparison, for example, with works by Dragalin and Danos et al., our procedure requires no special annotations on formulae and allows cut-rules to pass ov...
متن کامل